259 research outputs found

    Random Matching in the College Admissions Problem

    Get PDF
    In the college admissions problem, we consider the incentives confronting agents who face the prospect of being matched by a random stable mechanism. We provide a fairly complete characterization of ordinal equilbria. Namely, every ordinal equilib- rium yields a degenerate probability distribution. Furthermore, individual rationality is a necessary and sufficient condition for an equilibrium outcome, while stability is guaranteed in ordinal equilibrium where firms act straightforwardly. Finally, we re- late equilibrium behavior in random and in deterministic mechanisms.Matching; College Admissions Problem; Stability; Random Mechanism.

    School Choice and Information An Experimental Study on Matching Mechanisms

    Get PDF
    We present an experimental study where we analyze three well- known matching mechanisms - the Boston, the Gale-Shapley, and the Top Trading Cycles mechanisms - in three different informational set- tings. Our experimental results are consistent with the theory, sug- gesting that the TTC mechanism outperforms both the Boston and the Gale-Shapley mechanisms in terms of efficiency and it is as suc- cessful as the Gale-Shapley mechanism regarding the proportion of truthful preference revelation, whereas manipulation is stronger un- der the Boston mechanism. In addition, even though agents are much more likely to revert to truthtelling in lack of information about the others' payooffs - ignorance may be beneficial in this context - , the TTC mechanism results less sensitive to the amount of information that participants hold. These results therefore suggest that the use of the TTC mechanism in practice is more desirable than of the others.

    Incentives in Decentralized Random Matching Markets

    Get PDF
    Decentralized markets are modeled by means of a sequential game where, starting from any matching situation, firms are randomly given the opportunity to make job offers. In this random context, we prove the existence of ordinal subgame perfect equilibria where firms act according to a list of preferences. Moreover, every such equilibrium preserves stability for a particular profile of preferences. In particular, when firms act truthfully, every outcome is stable for the true preferences. Conversely, when the initial matching is the empty matching, every stable matching can be reached as the outcome of an ordinal equilibrium play of the game

    On Random Matching Markets: Properties and Equilibria

    Get PDF
    We consider centralized matching markets in which, starting from an arbitrary matchÂŹing, firms are successively chosen in a random fashion and offer their positions to the workers they prefer the most. We propose an algorithm that generalizes some well-known algorithms and explore some of its properties. In particular, different executions of the algorithm may lead to diferent output matchings. We then study incentives in the revÂŹelation game induced by the algorithm. We prove that ordinal equilibria always exist. Furthermore, every matching that results from an equilibrium play of the game is stable for a particular preference profile. Namely, if an ordinal equilibrium exists in which firms reveal their true preferences, only matchings that are stable for the true preferences can be obtained

    On Gale and Shapley ‘College admissions and stability of marriage’

    Get PDF
    In this note, we start to claim that established marriages can be heavily destabilized when the population of existing couples is enriched by the arrival of new candidates to marriage. Afterwards, we discuss briefly how stability concepts can be extended to account for entry and exit phenomena affecting the composition of the marriage market.Matching; stability; marriage model; divorce cascades

    Random matching in the college admissions problem

    Get PDF
    In the college admissions problem, we consider the incentives confronting agents who face the prospect of being matched by a random stable mechanism. We provide a fairly complete characterization of ordinal equilibria. Namely, every ordinal equilibrium yields a degenerate probability distribution. Furthermore, individual rationality is a necessary and sufficient condition for an equilibrium outcome, while stability is guaranteed in ordinal equilibria where firms act straightforwardly. Finally, we relate equilibrium behavior in random and in deterministic mechanisms.info:eu-repo/semantics/publishedVersio

    Incentives in decentralized random matching markets

    Get PDF
    Decentralized markets are modeled by means of a sequential game where, starting from any matching situation, firms are randomly given the opportunity to make job offers. In this random context, we prove the existence of ordinal subgame perfect equilibria where firms act according to a list of preferences. Moreover, every such equilibrium preserves stability for a particular profile of preferences. In particular, when firms act truthfully, every outcome is stable for the true preferences. Conversely, when the initial matching is the empty matching, every stable matching can be reached as the outcome of an ordinal equilibrium play of the gameinfo:eu-repo/semantics/publishedVersio

    Random Matching in the College Admissions Problem

    Get PDF
    In the college admissions problem, we consider the incentives confronting agents who face the prospect of being matched by a random stable mechanism. We provide a fairly complete characterization of ordinal equilbria. Namely, every ordinal equilibÂŹrium yields a degenerate probability distribution. Furthermore, individual rationality is a necessary and sufficient condition for an equilibrium outcome, while stability is guaranteed in ordinal equilibrium where firms act straightforwardly. Finally, we reÂŹlate equilibrium behavior in random and in deterministic mechanisms.Financial support from the Fundação para a CiĂȘncia e a Tecnologia under grant SFRH/BD/5308/2001 and from the spanish Ministerio de Ciencia y Tecnologia under research grant BEC2002-02130

    College admissions and the role of information : an experimental study

    Get PDF
    We analyze two well-known matching mechanisms—the Gale-Shapley, and the Top Trading Cycles (TTC) mechanisms—in the experimental lab in three different informational settings, and study the role of information in individual decision making. Our results suggest that—in line with the theory—in the college admissions model the Gale-Shapley mechanism outperforms the TTC mechanisms in terms of efficiency and stability, and it is as successful as the TTC mechanism regarding the proportion of truthful preference revelation. In addition, we find that information has an important effect on truthful behavior and stability. Nevertheless, regarding efficiency, the Gale-Shapley mechanism is less sensitive to the amount of information participants hold

    Bioconversion of cheese whey into polyhydroxyalkanoates

    Get PDF
    Dissertação para obtenção do Grau de Doutor em Engenharia Química e Bioquímic
    • 

    corecore